solving group scheduling problem in no-wait flow shop with sequence dependent setup times

Authors

abolfazl adressi

reza bashirzadeh

vahid azizi

saeed tasouji hassanpour

abstract

different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly substituted with new ones for improving the efficiency and effectiveness of the entire production system. in this paper, two meta-heuristic algorithms, genetic and simulated annealing, have been used in order to solve the group scheduling problem of jobs in a single stage no-wait flow shop environment in which setup times are sequence dependent,. the purpose of solving the proposed problem is to minimize the maximum time needed to complete the jobs (makespan). the results show that genetic algorithm is efficient in problems with small and large dimensions, with respect to time parameter of problem solving.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

full text

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

full text

Solving Re-entrant No-wait Flow Shop Scheduling Problem

In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...

full text

an assembly flow-shop scheduling problem with sequence-dependent setup and transportation times

in this paper, three-stage assembly flowshop scheduling is considered with respect to minimizing bi-objectives, namely mean flow time and mean tardiness. this problem is a model of production systems, which several production operations are done simultaneously and independently, and then produced components are collected and transferred to an assembly stage for the final operation. in this mode...

full text

New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...

full text

My Resources

Save resource for easier access later


Journal title:
journal of modern processes in manufacturing and production

Publisher: islamic azad univesity, najafabad branch

ISSN

volume 3

issue 1 2014

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023